/*
 * Copyright 2012 Faisal Aslam.
 * All Rights Reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER
 * 
 * This code is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 3
 * only, as published by the Free Software Foundation.
 * 
 * This code is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * General Public License version 3 for more details (a copy is
 * included in the LICENSE file that accompanied this code).
 * 
 * You should have received a copy of the GNU General Public License
 * version 3 along with this work; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
 * 02110-1301 USA
 * 
 * Please contact Faisal Aslam (faisal.aslam AT gmail.com)
 * if you need additional information or have any questions.
 */
package takatuka.classreader.logic.parallel.readFile;

import java.util.*;

/**
 *
 *
 * @author Faisal Aslam
 */ 
class FuncDependencies implements Comparable<FuncDependencies> {

    private int myFuncId = 0;
    private ArrayList<Integer> parentIds = new ArrayList<Integer>();

    public FuncDependencies(int myFuncId) {
        this.myFuncId = myFuncId;
    }

    public FuncDependencies(int myFuncId, ArrayList<Integer> parentIds) {
        this.myFuncId = myFuncId;
        this.parentIds = parentIds;
    }

    public void addParent(int parentId) {
        parentIds.add(parentId);
    }

    @Override
    public String toString() {
        String ret = "";
        ret += myFuncId;
        Collections.sort(parentIds);
        for (Integer id : parentIds) {
            ret += "," + id;
        }
        //ret += "|";
        return ret;
    }

    public int compareTo(FuncDependencies o) {
        if (o.myFuncId > myFuncId) {
            return 1;
        } else if (o.myFuncId < myFuncId) {
            return -1;
        }
        return 0;
    }
}
